Generalized convexity in nondifferentiable programming
نویسندگان
چکیده
منابع مشابه
Duality in nondifferentiable minimax fractional programming with generalized convexity
A Mond–Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F,a,q,d)-pseudoconvex functions. 2005 Elsevier Inc. All rights reserved.
متن کاملDuality for Nondifferentiable Multiobjective Semi-infinite Programming with Generalized Convexity
The purpose of this paper is to consider the Mond-Weir type dual model for a class of non-smooth multiobjective semi-infinite programming problem. In this work, we use generalization of convexity namely ( , ) G F θ − convexity and Kuhn-Tucker constraint qualification, to prove new duality results for such semi-infinite programming problem. Weak, strong and converse duality theorems are derived....
متن کاملSecond-order duality for nondifferentiable minimax fractional programming problems with generalized convexity
*Correspondence: [email protected] Department of Mathematics, University of Tabuk, Tabuk, Kingdom of Saudi Arabia Abstract In the present paper, we are concerned with second-order duality for nondifferentiable minimax fractional programming under the second-order generalized convexity type assumptions. The weak, strong and converse duality theorems are proved. Results obtained in this paper ext...
متن کاملNondifferentiable multiobjective programming under generalized dI-invexity
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce four new classes of generalized convex functions by combining the concepts of weak strictly pseudoinvex, strong pseudoinvex, weak quasi invex, weak pseudoinvex and strong quasi invex functions in Aghezzaf and Hachimi [Numer. Funct. Anal. Optim. 22 (2001) 775], d-...
متن کاملGeneralized Second-Order Mixed Symmetric Duality in Nondifferentiable Mathematical Programming
and Applied Analysis 3 It can be easily seen that for a compact convex set C, y is in NC x if and only if S y | C xy, or equivalently, x is in ∂S y | C . Definition 2.2. A functional F : X × X × R → R where X ⊆ R is sublinear with respect to the third variable if for all x, u ∈ X ×X, i F x, u; a1 a2 ≤ F x, u; a1 F x, u; a2 for all a1, a2 ∈ R, ii F x, u;αa αF x, u; a , for all α ∈ R and for all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1984
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700001908